On the locality of arb-invariant first-order logic with modulo counting quantifiers F. Harwath N. Schweikardt

Source URL: highlights-conference.org

On Finite Domains in First-Order Linear Temporal Logic? Julien Brunel1 , David Chemouil1 , and Denis Kuperberg1,2 1 2

Source URL: www.cs.swansea.ac.uk

TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism Jasmin Christian Blanchette1 and Andrei Paskevich2,3 1 Fakultät für Informatik, Technische Universität München, Germany

Source URL: www4.in.tum.de

• Logic
• Linguistics
• Philosophical logic
• Symbol
• Mixing
• Interpretation

Syntax-Guided Synthesis Rajeev ALUR a , Rastislav BODIK b , Eric DALLAL c , Dana FISMAN a , Pranav GARG d , Garvit JUNIWAL b , Hadas KRESS-GAZIT e , P. MADHUSUDAN d , Milo M. K. MARTIN a , Mukund RAGHOTHAMAN a , Shamwadi

Source URL: sygus.seas.upenn.edu

• Predicate logic
• Theoretical computer science
• Formal methods
• NP-complete problems
• First-order logic
• Satisfiability Modulo Theories
• Expression
• Type system
• Function
• Mathematics
• Logic
• Mathematical logic

An Automata Model for Trees with Ordered Data Values Tony Tan University of Edinburgh Edinburgh, UK Email:

Source URL: alpha.uhasselt.be

• Mathematical logic
• Theoretical computer science
• Tree automaton
• Tree
• Linear temporal logic
• First-order logic
• Finite-state machine
• Context-free grammar
• T-tree
• Automata theory
• Mathematics
• Formal languages

Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization Diego Figueira CNRS, LaBRI, France & University of Edinburgh, UK Santiago Figueira

Source URL: www.glyc.dc.uba.ar

• Functional languages
• XML
• Model theory
• XPath 1.0
• XPath
• First-order logic
• Constructible universe
• XQuery
• XSLT
• Computing
• Web standards
• Mathematical logic

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies Santiago Figueira Daniel Gor´ın

Source URL: www.glyc.dc.uba.ar

• Model theory
• Logical syntax
• Philosophical logic
• Interpretation
• Entailment
• First-order logic
• Prenex normal form
• Well-formed formula
• Logical connective
• Logic
• Metalogic
• Formal languages

An Abstract Completion Procedure for Cut Elimination in Deduction Modulo Guillaume Burel École Normale Supérieure de Lyon & LORIA∗ The complementarity and interaction between computation

Source URL: www.ensiie.fr

• Cut-elimination theorem
• Sequent
• Rule of inference
• First-order logic
• Formal proof
• Natural deduction
• Structural proof theory
• Logic
• Proof theory
• Mathematical logic

First-order reasoning in Yices2 Master Thesis in Computer Science Simon Cruanes∗ supervised by Bruno Dutertre †, Viktor Kuncak ‡, Benjamin Werner § SRI International, Menlo Park, CA September 2011 – March 2012

Source URL: cedeela.fr

• Automated theorem proving
• Model theory
• Logic in computer science
• Constraint programming
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability Modulo Theories
• DPLL algorithm
• Interpretation
• Theoretical computer science
• Logic
• Mathematical logic

On the Formal Semantics of IF-like Logics Santiago Figueiraa,b , Daniel Gor´ına , Rafael Grimsonc a Departamento de Computaci´ on, FCEyN

Source URL: www.glyc.dc.uba.ar

• Model theory
• Predicate logic
• Non-classical logic
• Quantification
• Interpretation
• First-order logic
• Independence-friendly logic
• FO
• Lambda calculus
• Logic
• Mathematical logic
• Philosophical logic